#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define in read<int>()
#define lin read<ll>()
#define rep(i, x, y) for(int i = (x); i <= (y); i++)
#define per(i, x, y) for(int i = (x); i >= (y); i--)

using namespace std;

using ll = long long;
using db = double;
using pii = pair < int, int >;
using vec = vector < int >;
using veg = vector < pii >;

template < typename T > T read() {
	T x = 0; bool f = 0; char ch = getchar();
	while(!isdigit(ch)) f |= ch == '-', ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar();
	return f ? -x : x;
}

#define OK return puts("White"), void()
#define DR return puts("Draw"), void()

template < typename T > void chkmax(T &x, const T &y) { x = x > y ? x : y; }
template < typename T > void chkmin(T &x, const T &y) { x = x < y ? x : y; }

const int N = 1e6 + 10;

int deg[N], n;
vec G[N];
char s[N];

void solve() {
	n = in; 
	rep(i, 2, n) { int u = in, v = in; G[u].eb(v); G[v].eb(u); deg[u]++, deg[v]++; }
	scanf("%s", s + 1);
	if(n < 3) DR;
	if(n == 3) {
		int al = 0; rep(i, 1, n) al += s[i] == 'W';
		if(al >= 2) OK; else DR;
	}
	rep(i, 1, n) if(s[i] == 'W') { ++n; G[i].eb(n); G[n].eb(i); deg[n] = 3; deg[i]++; }
	int tcnt = 0;
	rep(i, 1, n) {
		if(deg[i] > 3) OK;
		if(deg[i] == 3) {
			int al = 0; for(auto y : G[i]) al += deg[y] >= 2;
			if(al >= 2) OK; tcnt++;
		}
	} if(tcnt == 2 && n & 1) OK; DR;
}

void clear() { rep(i, 1, n) deg[i] = 0, G[i].clear(); }

int main() {
#ifndef ONLINE_JUDGE
	freopen("1.in", "r", stdin);
#endif
	int T = in; while(T--) solve(), clear();
	return 0;
}
